On the upper bound in Varadhan’s Lemma
نویسندگان
چکیده
منابع مشابه
On the upper bound in Varadhan’s Lemma
In this paper, we generalize the upper bound in Varadhan’s Lemma. The standard formulation of Varadhan’s Lemma contains two important elements, namely an upper semicontinuous integrand and a rate function with compact sublevel sets. However, motivated by results from queueing theory, in this paper we do not assume that rate functions have compact sublevel sets. Moreover, we drop the assumption ...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملan upper bound on the first zagreb index in trees
in this paper we give sharp upper bounds on the zagreb indices and characterize all trees achieving equality in these bounds. also, we give lower bound on first zagreb coindex of trees.
متن کاملa study on the effectiveness of textual modification on the improvement of iranian upper-intermediate efl learners’ reading comprehension
این پژوهش به منظور بررسی تأثیر اصلاح متنی بر بهبود توانایی درک مطلب زبان آموزان ایرانی بالاتر از سطح میانی انجام پذیرفت .بدین منظور 115 دانشجوی مرد و زن رشته مترجمی زبان انگلیسی در این پزوهش شرکت نمودند.
On trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 2015
ISSN: 0167-7152
DOI: 10.1016/j.spl.2015.04.005